A Logic for Parametric Polymorphism

TCLP: overloading, subtyping and parametric polymorphism made practical for constraint logic programming

A Logic for Parametric Polymorphism with Effects

We present a logic for reasoning about parametric polymorphism in combination with arbitrary computational effects (nondeterminism, exceptions, continuations, side-effects etc.). As examples of reasoning in the logic, we show how to verify correctness of polymorphic type encodings in the presence of effects.

From parametric polymorphism to models of polymorphic FPC

This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...

Specifying Functional Programs with Intuitionistic First Order Logic

We propose a method of specifying functional programs (in a subset of Haskell) using intuitionistic first order logic, that works well for inductive datatypes, higher-order functions and parametric polymorphism.

On Plotkin-Abadi Logic for Parametric Polymorphism Towards a Categorical Understanding

The idea of parametric polymorphism is that of a single operator that can be used for di erent data types and whose behaviour is somehow uniform for each type. Reynolds [Reynolds, 1983] uses binary relations to de ne a uniformity condition for parametric polymorphism. In [Plotkin & Abadi, 1993] the authors proposed a second order logic for second order lambda-calculus; this logic is able to han...